Discovering larger network motifs: Network Motif clustering

نویسندگان

  • Chen Li
  • Wooyoung Kim
چکیده

In this project, we aim to discover large network motifs. The main idea would be 1) combining smaller network motifs and extend it to larger network motifs or 2) using clustering algorithms to find more compact representation for the whole network, then using existing or new algorithm for finding network motifs. In order to find the appropriate approaches, we reviewed some of related papers, about clustering algorithms for bioinformatics applications [1], and about network motifs algorithms [3].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering larger network motifs: Network clustering for Network Motif discovery

We want to discover larger network motifs, with more than 15 number of nodes. In order to propose an algorithm for finding larger network motifs in any biological network, we review some of models and algorithms to find network motifs. There are two types of methods, one is exact counting and the other is approximate sampling. Generalization of random graphs is another important issue to evalua...

متن کامل

Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking

The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs – network-centric subgraph enumeration and sampling – have been limited to motifs of 6 to 8 nodes, revealing only the smallest network components. New methods are necessary to identify larger network sub-structures and functional motifs. Her...

متن کامل

Innovative Algorithms and Evaluation Methods for Biological Motif Finding

Biological motifs are defined as overly recurring sub-patterns in biological systems. Sequence motifs and network motifs are the examples of biological motifs. Due to the wide range of applications, many algorithms and computational tools have been developed for efficient search for biological motifs. Therefore, there are more computationally derived motifs than experimentally validated motifs,...

متن کامل

Parallel Network Motif Finding

Network motifs are over-represented patterns within a network, and signify the fundamental building blocks of that network. The process of finding network motifs is closely related to the traditional subgraph isomorphism problem in computer science, which finds instances of a particular subgraph in a graph. This problem has been proven NP-complete, and thus even for relatively small subgraphs a...

متن کامل

Exploring Gene Signatures in Different Molecular Subtypes of Gastric Cancer (MSS/ TP53+, MSS/TP53-): A Network-based and Machine Learning Approach

Gastric cancer (GC) is one of the leading causes of cancer mortality, worldwide. Molecular understanding of GC’s different subtypes is still dismal and it is necessary to develop new subtype-specific diagnostic and therapeutic approaches. Therefore developing comprehensive research in this area is demanding to have a deeper insight into molecular processes, underlying these subtypes. In this st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009